Efficient Exploration With Latent Structure

نویسندگان

  • Bethany R. Leffler
  • Michael L. Littman
  • Alexander L. Strehl
  • Thomas J. Walsh
چکیده

When interacting with a new environment, a robot can improve its online performance by efficiently exploring the effects of its actions. The efficiency of exploration can be expanded significantly by modeling and using latent structure to generalize experiences. We provide a theoretical development of the problem of exploration with latent structure, analyze several algorithms and prove matching lower bounds. We demonstrate our algorithmic ideas on a simple robot car repeatedly traversing a path with two different surface properties.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Bacillus Cereus as a Geo-Biological Marker For Gold Prospecting in Iran

Several methods have been developed for gold exploration in the past, among which biological base method is known to be the most efficient with least expenses. This method can also be used for latent gold prospects exploration. In the present study, the possibility of applying Bacillus cereus frequency in soil as a biological marker was investigated for the exploration of latent gold prospectin...

متن کامل

General Latent Feature Modeling for Data Exploration Tasks

This paper introduces a general Bayesian nonparametric latent feature model suitable to perform automatic exploratory analysis of heterogeneous datasets, where the attributes describing each object can be either discrete, continuous or mixed variables. The proposed model presents several important properties. First, it accounts for heterogeneous data while can be inferred in linear time with re...

متن کامل

Autonomous Exploration of Mobile Robots through Deep Neural Networks

The exploration problem of mobile robots aims to allow mobile robots to explore an unknown environment. We describe an indoor exploration algorithm for mobile robots using a hierarchical structure that fuses several convolutional neural network layers with the decision-making process. The whole system is trained end to end by taking only visual information (RGB+D information) as input and gener...

متن کامل

LDA v. LSA: A Comparison of Two Computational Text Analysis Tools for the Functional Categorization of Patents

One means to support for design-by-analogy (DbA) in practice involves giving designers efficient access to source analogies as inspiration to solve problems. The patent database has been used for many DbA support efforts, as it is a preexisting repository of catalogued technology. Latent Semantic Analysis (LSA) has been shown to be an effective computational text processing method for extractin...

متن کامل

Latent Process Decomposition of High-Dimensional Count Data By

Next-generation sequencing (NGS) technologies have become the preferred way of exploring a genome. These data are high-dimensional discrete counts with latent structure that, once revealed, will reduce the dimensions and will lead to the subsets of genes that are suitable for further exploration. Latent Process Decomposition of high-dimensional count data (LPD-C) is presented as a two stage app...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005